Trajectories of directed lattice paths

نویسندگان

چکیده

The distribution of monomers along a linear polymer grafted on hard wall is modelled by determining the probability occupied vertices Dyck and ballot path models adsorbing polymers. For example, that passes through lattice site with coordinates $(\lfloor \epsilon n \rfloor,\lfloor \delta \sqrt{n}\rfloor)$ in square lattice, for $0 < 1$ $\delta\geq 0$, determined asymptotically as $n\to\infty$ this uncovers density paths limit length $n$ approaches infinity: $$\hbox{P}_r (\epsilon,\delta) = \frac{4\delta^2}{\sqrt{\pi\,\epsilon^3(1-\epsilon)^3}} \, e^{-\delta^2/\epsilon(1-\epsilon)}\ .$$ properties coating or relevant applications such stabilisation colloid dispersion drug delivery system drug-eluding stent covered polymer.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Basic analytic combinatorics of directed lattice paths

This paper develops a uni(ed enumerative and asymptotic theory of directed two-dimensional lattice paths in half-planes and quarter-planes. The lattice paths are speci(ed by a (nite set of rules that are both time and space homogeneous, and have a privileged direction of increase. (They are then essentially one-dimensional objects.) The theory relies on a speci(c “kernel method” that provides a...

متن کامل

Some reflections on directed lattice paths

This article analyzes directed lattice paths, when a boundary reflecting or absorbing condition is added to the classical models. The lattice paths are characterized by two time-independent sets of rules (also called steps) which have a privileged direction of increase and are therefore essentially one-dimensional objects. Depending on the spatial coordinate, one of the two sets of rules applie...

متن کامل

Covering partially directed graphs with directed paths

We consider graphs which contain both directed and undirected edges (partially directed graphs). We show that the problem of covering the edges of such graphs with a minimum number of edge-disjoint directed paths respecting the orientations of the directed edges is polynomially solvable.We exhibit a good characterization for this problem in the form of a min–max theorem.We introduce a more gene...

متن کامل

Paths of the Directed Suspension

We prove that the loop space of the directed suspension of a directed space is homotopy equivalent to the James construction. In particular, it does not depend on the directed structure of a given directed space.

متن کامل

Counting Lattice Paths

Counting lattice paths Maciej Dziemiańczuk A lattice path is a finite sequence of points p0, p1, . . . , pn in Z × Z, and a step of the path is the difference between two of its consecutive points, i.e., pi−pi−1. In this thesis, we consider lattice paths running between two fixed points and for which the set of allowable steps contains the vertical step (0,−1) and some number (possibly infinite...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Physica Scripta

سال: 2023

ISSN: ['1402-4896', '0031-8949']

DOI: https://doi.org/10.1088/1402-4896/acbb3d